Random graphs in the monadic theory of order

Random graphs in the monadic theory of order

We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the monadic theory of all chains. It is provable from ZFC that the theory of random graphs is not interpretable in the monadic second order theory of short chains (hence, in the monadic theory of the real line). We are intere...

Monadic Second Order Asymptotics on Random Acyclic Graphs

We classify the vertices of trees, and use a primitive Poisson approximation argument to prove that almost all trees have almost the same proportion of vertices of each kind. We use a graph surgery construction to investigate the asymptotic probabilities of order-invariant Monadic Second Order (with built-in linear ordering) queries over random free trees, proving that for any MSO query , the p...

the analysis of the role of the speech acts theory in translating and dubbing hollywood films

از محوری ترین اثراتی که یک فیلم سینمایی ایجاد می کند دیالوگ هایی است که هنرپیش گان فیلم میگویند. به زعم یک فیلم ساز, یک شیوه متأثر نمودن مخاطب از اثر منظوره نیروی گفتارهای گوینده, مثل نیروی عاطفی, ترس آور, غم انگیز, هیجان انگیز و غیره, است. این مطالعه به بررسی این مسأله مبادرت کرده است که آیا نیروی فراگفتاری هنرپیش گان به مثابه ی اعمال گفتاری در پنج فیلم هالیوودی در نسخه های دوبله شده باز تولید...

Circle graphs and monadic second-order logic

A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique representation as a set of intersecting chords, and we prove that this representation can be defined by monadic second-order formulas. By using the (canonical) split decomposition of a circle graph, one can define in mona...

Definability in the Monadic Second-Order Theory of Successor